package cn.shenzz.suixiang.dp.leetcode_494;

class Solution {
    public int findTargetSumWays(int[] nums, int target) {
        int n = nums.length;
        int[] dp = new int[target];

        return -1;
    }
}